Maximum energy delay locked loop for cluster path processing in a wireless device

ABSTRACT

A system for processing radio frequency (RF) signals includes a searcher and a Cluster Path Processor (CPP). The searcher detects a maximum signal energy level and position of at least one of a plurality of individual distinct path signals in a signal cluster, wherein at least a portion of the plurality of individual distinct path signals is received within a duration of a corresponding delay spread. The CPP includes a group finger array having a plurality of group fingers and determines a coarse sampling position of the group finger array based upon the position of the at least one of a plurality of individual distinct path signals in the signal cluster. The CPP determines a fine sampling position based upon determines a composite channel energy estimate for the plurality of individual distinct path signals. Using this fine sampling position, the CPP receives at least a portion of the plurality of individual distinct path signals by the group finger array.

CROSS-REFERENCE TO RELATED APPLICATION

This application makes reference to co-pending U.S. Ser. No. 11/173,854, filed Jun. 30, 2005.

FIELD OF THE PRESENT INVENTION

The present invention relates to wireless communications and more particularly considers methodologies and systems for receiving and processing signals in a frequency selective multipath fading channel.

BACKGROUND OF THE PRESENT INVENTION

A wideband code division multiple access (W-CDMA) base transceiver station (BTS) may transmit a radio frequency (RF) signal, which may be reflected, and/or attenuated by various obstacles and surrounding objects while propagating though a transmission medium. Each of these reflections may comprise an individual distinct path, or path. As a result, a mobile receiver may receive a plurality of individual distinct versions of the transmitted signal, at a plurality of distinct time instants. Each of the received plurality of individual distinct versions of the transmitted signal may be associated with an individual distinct path and be referred to as an individual distinct path signal. A time instant associated with an individual distinct path signal, and a time instant associated with a subsequent individual distinct path signal may comprise a time offset. Various of the plurality of individual distinct path signals may be received at a received signal power level that may vary among the received plurality of individual distinct path signals. A time offset may vary among the received plurality of individual distinct path signals. For example, a time offset associated with an n^(th) individual distinct path signal, and an (n+1)^(th) individual distinct path signal, may differ from a time offset associated with an m^(th) individual distinct path signal, and a (m+1)^(th) individual distinct path signal, for m≠n. A measure of a time offset may be referred to as temporal proximity.

The plurality of individual distinct path signals that may be received at the mobile receiver may be referred to as multipath signals, or a multipath. A medium through which a transmitted RF signal may be propagated is referred to as the RF channel, or a channel. Transmission impairments, or impairments, may be present in the channel that may introduce distortion, interference, and/or distortion as the transmitted RF signal propagates through the channel. The presence of transmission impairments may increase the difficulty of recovering a transmitted RF signal at a mobile receiver based on corresponding received multipath signals. The channel may be characterized by its RF bandwidth and whether the channel comprises a single path, or a multipath (selective fading channel). A channel that comprises a single path may be referred to as a “flat fading channel.” A channel that comprises a multipath may be referred to as a “selective fading channel.”

During reception of a multipath, and subsequent recovery of the corresponding transmitted RF signal, a multiplicative complex factor, comprising gain and RF phase, may be applied to an individual distinct path signal. The numerical values associated with the gain and RF phase may vary as the mobile receiver is moved from one location to another. The multipath signals may be characterized according to their energy levels. Each signal-path has associate therewith a respective geometric distance, which causes respective copies of the transmitted RF signal to arrive spread over time. This time duration may comprise a plurality of time instants during which a plurality of individual distinct path signals that constitute a multipath may be received at a mobile receiver. This time duration may also be referred to as a “delay spread.” During reception of a multipath at a mobile receiver, a profile for the measured signal path energy may an increase and decrease during a relatively short time period. This time period may be referred to as a path life time. Consequently, the transmission medium, through which a transmitted RF signal propagates, may comprise time varying characteristics that influence the multipath that is received at the mobile receiver. The multipath may comprise a plurality of individual distinct path signals that may be received at a mobile receiver based on statistical properties.

A rake receiver may be utilized to recover an estimate of a transmitted RF signal based carried in received multipath signals. The rake receiver may implement a process that comprises generating an estimate for each received individual distinct path signal in the multipath. This generated estimate may be referred to as a channel estimate. A channel estimate that is generated based on an individual distinct path signal may be referred to as a path estimate. The process may further comprise descrambling the received multipath through application of a Gold code (GC). The GC may be applied to the received multipath at a time instant that is time synchronized to a reception, by the mobile receiver, of an individual distinct path signal. The descrambling may be referred to as correlating. Circuitry that performs the correlating may be referred to as a correlator.

The rake receiver may comprise a plurality of correlators, wherein an individual correlator may be time synchronized to a reception, by the mobile receiver, of an individual distinct path signal. The correlator may be referred to as performing time tracking on an individual distinct path signal. Following correlation a path estimate may be generated. The path estimate may be utilized to recover an estimate for at least a portion of the corresponding transmitted RF signal. Subsequently, the rake receiver may perform an operation on the received plurality of path estimates that comprises a time compensation, and combining.

Within the rake receiver, circuitry, referred to as a “finger,” may be assigned to process a received individual distinct path signal. The finger may perform the steps described above, during reception of the assigned received individual distinct path signal. A finger among a plurality of fingers in a rake receiver may be assigned to a corresponding one of a received plurality of individual distinct path signals that form component signals in a multipath. The output of the fingers may then be combined and further demodulated and decoded. The fingers may be implemented to receive and process as much of the received signal energy as practicable.

A considerable part of receiver design may involve managing the rake receiver fingers. A functional block known as a “searcher” may be adapted to locate new multipath signals and to allocate rake receiver fingers to the new multipath. The searcher may detect a path based on the amount of energy contained in a signal, identify that path if it carries user data, and subsequently monitor the detected path. Once the detected signal energy in a path is above a given threshold, a finger in the rake receiver may be assigned to the path and the signal energy level constantly monitored.

However, partitioning the received signal into several fingers, each of which may process and exploit energy in a single path, may have limitations. For example, a multipath may rarely be characterized by a distinct discrete time of arrival in connection with each received individual distinct path signal. As a result, the rake receiver may be inefficient at exploiting the power in received signals. In addition, utilizing this method may incur high processing overhead in managing the fingers. The total amount of time required to identify a path, assign a finger, and exploit the signal energy may account for 20-30% of the life span of a path. Once a finger is assigned to a path, detected energy on the path may be continuously monitored. However by the time the finger has been assigned, the path energy may be diminished, while energy may arrive at a different time. This may result in the rake receiver constantly searching for new paths and performing finger de-allocation/allocation cycles. A finger that is allocated to a path with diminishing power may represent misused resources in the mobile terminal, which may in turn lower performance of the mobile terminal.

Another limitation in the conventional rake receiver is known as finger merge or ‘fat’ finger. This is a phenomenon in which paths are in close temporal proximity of each other. If a time difference between received individual distinct path signals is below some threshold value, more than one finger, among a plurality of fingers in a rake receiver, may be assigned to a common individual distinct path signal. Also, as a result of the close proximity, a bias may be introduced into the processing of the received multipath, whereby the two or more fingers track a single received individual distinct path signal. This fat finger phenomenon may result in negative implications for system performance.

The assignment of more than one finger to a received individual distinct path signal may be a waste of system resources, as the additional finger or fingers may be better deployed receiving additional energy from another received individual distinct path signal in the multipath, or receiving energy from a signal transmitted from another BTS. In addition, the combined power of the various fingers may often be used to control various system parameters, for example, power control. Without accounting for finger merge, a system may overestimate the received power due the duplication of energy detected in the combiner, and thus overcompensate by lowering transmit power to a threshold level below that required for adequate communication. Moreover, combining the output of merged fingers with the output of non-merged fingers may weight both the signal and noise of the merged finger output too heavily in relation to the non-merged finger output, which may result in inefficient exploitation of the received power.

Further limitations and disadvantages of conventional and traditional approaches will become apparent to one of skill in the art, through comparison of such systems with some aspects of the present invention as set forth in the remainder of the present application with reference to the drawings.

BRIEF SUMMARY OF THE PRESENT INVENTION

A method and/or system for managing, controlling and combining signals in a frequency selective multipath fading channel, substantially as shown in and/or described in connection with at least one of the figures, as set forth more completely in the claims. These and other advantages, aspects and novel features of the present invention, as well as details of an illustrated embodiment thereof, will be more fully understood from the following description and drawings.

BRIEF DESCRIPTION OF SEVERAL VIEWS OF THE DRAWINGS

FIG. 1 is a diagram illustrating an exemplary multipath cluster that may be received by a mobile receiver, which may be utilized in connection with an embodiment of the present invention.

FIG. 2 is a block diagram illustrating an exemplary signal cluster preprocessor in a mobile receiver, in accordance with an embodiment of the present invention.

FIG. 3 a is a block diagram of an exemplary cluster path processor (CPP), in accordance with an embodiment of the present invention.

FIG. 3 b is a block diagram of an exemplary channel estimation operation—in the CPP, in accordance with an embodiment of the present invention.

FIG. 3 c is a block diagram of an exemplary cluster tracker operation, in accordance with an embodiment of the present invention.

FIG. 3 d is a block diagram of an exemplary timing control operation, in accordance with an embodiment of the present invention.

FIG. 4 is an exemplary diagram illustrating various aspects of signal clusters, in connection with an embodiment of the present invention.

FIG. 5 a is a graph that illustrates exemplary cluster moment calculations for a fully acquired signal cluster, in accordance with an embodiment of the present invention.

FIG. 5 b is a graph that illustrates exemplary cluster moment calculations for a partially acquired signal cluster, in accordance with an embodiment of the present invention.

FIG. 6 is an exemplary flow diagram illustrating cluster path processing of a received signal cluster, in accordance with an embodiment of the present invention.

FIG. 7 is an exemplary diagram illustrating various aspects of signal clusters having overlapping delay spreads in connection with an embodiment of the present invention.

FIG. 8 is an exemplary diagram illustrating various aspects of the signal clusters of FIG. 7 showing the coarse alignment of group fingers of a CPP of an embodiment of the present invention.

FIG. 9 is an exemplary diagram illustrating various aspects of the signal clusters of FIG. 7 showing the fine alignment of group fingers of a CPP of an embodiment of the present invention.

FIG. 10 is an exemplary flow diagram illustrating the fine alignment of group fingers in conjunction with cluster path processing of a received signal cluster, in accordance with an embodiment of the present invention.

DETAILED DESCRIPTION OF THE PRESENT INVENTION

Certain embodiments of the present invention may be found in a method and system for processing multipath clusters. Various embodiments of the present invention describe a cluster path processor (CPP) that may process multipath signals wherein a temporal proximity between consecutive individual distinct path signals may be approximately equal across the multipath signals. The CPP may process multipath signals where channel estimation, and recovery of a corresponding transmitted RF signal is based on an estimate of an aggregate of at least a portion of the received individual distinct path signals contained in the multipath signals. The CPP may process a multipath based on at least a portion of a total signal energy level contained in the multipath that comprises an aggregate of signal energy from each of the constituent individual distinct path signals.

In various embodiments of the present invention, the performance of the CPP in tracking and recovering RF signals may be less sensitive to fluctuations in temporal proximity and signal energy level that may be evidenced in a received individual distinct path signal. This CPP may facilitate novel and efficient methods for implementing processes such as assigning, tracking, measuring and reporting information (for example, energy and temporal location) based on statistical means as observed across a received signal cluster. This may eliminate the need for applying the same tasks, as may be performed by a rake receiver, on each of the received individual distinct path signals contained in the signal cluster. Various embodiments of the present invention may include receiver designs that comprise a plurality of CPPs.

FIG. 1 is a diagram illustrating an exemplary multipath cluster that may be received by a mobile receiver, which may be utilized in connection with an embodiment of the present invention. With reference to FIG. 1 there is shown a transmitter 102, a mobile receiver 104, a multipath cluster 106, and a plurality of individual distinct path signals 110, 112, and 114. The plurality of individual distinct path signals 110, 112, and 114 may represent component signals in a multipath. The plurality of signals 110, 112 and 114, that may be received by the mobile receiver 104, may be referred to as a multipath cluster 106.

With reference to FIG. 1, a transmitted radio frequency (RF) signal may be emitted by the transmitter 102, and subsequently form a multipath of individual path signals 110, 112, and 114, at a plurality of angles of departure (AODs) in relation to the transmitter 102. One of the plurality of AODs may correspond to an individual distinct path that is utilized by an individual distinct path signal 110, 112, and 114. The plurality of individual distinct path signals 110, 112 and 114 may arrive at the mobile receiver 104 at a plurality of angles of arrival (AOAs) in relation to the mobile receiver 104. Within the transmission medium between the transmitter 102 and mobile receiver 104, a transmitted RF signal may experience a coherent and direct line of sight path, as indicated by signal 110. The transmitted RF signal may be also experience reflections within the intervening communications medium that produces a plurality of individual distinct path signals, each of which may arrive at the mobile receiver 104 at a different AOA as indicated by signals 112 and 114.

The individual distinct path signals 110, 112 and 114, that comprise the multipath cluster 106, may arrive at the mobile receiver 104 at a plurality of time instants within a delay spread. Arrival times for signals 110, 112, and 114 may vary depending upon the lengths of individual distinct paths taken by the corresponding signals 110, 112, and 114. Thus, a plurality of individual distinct path signals that utilize individual distinct paths comprising similar path lengths between the transmitter 102 and the mobile receiver 104 may arrive at the mobile receiver 104 at times that are detectably distinct. Individual distinct path signals that utilize similar path lengths may be in temporal proximity. Individual distinct path signals that do not utilize similar path lengths may not be in temporal proximity. In some conventional rake receiver designs, a plurality of fingers may be assigned to track a corresponding plurality of individual distinct path signals that are in temporal proximity, and may result in occurrence of the fat finger phenomenon.

In various embodiments of the present invention, a single CPP may be assigned to track a group of signals comprising at least a portion of a plurality of individual distinct path signals that are in temporal plurality based on a computed aggregate signal energy level for at least a portion of a received signal cluster 106, and thereby reduce the likelihood of producing an instance of the fat finger phenomenon.

An n^(th) individual distinct path signal, in a signal cluster, may arrive, at the mobile receiver 104, at a time T(n); n=0, L−1 where L is the number of distinct paths the CPP block 208 can track. A value of the time T(n) may be measured relative to a time at the start of the corresponding delay spread that is associated with the receipt of the signal cluster. A plurality of individual distinct path signals that arrive at the mobile receiver 104 at a plurality of times T(n) may comprise the signal cluster, or cluster.

In some conventional rake receiver designs two distinct paths may be in temporal proximity of each one. If the value of their time difference is too small, for example, less than a value that corresponds to a reciprocal of a bandwidth that is associated with the channel, the fat finger phenomenon may occur in the rake receiver.

In one aspect of the present invention, a first moment time, T_(fm), may be computed. The first moment time T_(fm) may represent a center time for the reception of the multipath cluster 106 at the mobile receiver 104. The center time may comprise a weighted average time for reception of signal energy over a duration of a delay spread. A value for the delay spread may be determined based on characteristics of a channel. In various embodiments of the present invention, a value for the delay spread, T_(ds), may be set in accordance with the characteristics of the channel. For example, if the first portion of a signal cluster 106 is received at the receiver at a time t_(start), a last portion may be received at a time instant approximately described as t_(start)+T_(ds). In an exemplary embodiment of the time offset, t_(off), may be determined to be:

$\begin{matrix} {t_{off} \cong \frac{T_{ds}}{L - 1}} & {{equation}\mspace{14mu}\lbrack 1\rbrack} \end{matrix}$ where L may comprise a value that represents a number of group fingers utilized in the CPP, for example, a value of 16.

A value for a time at which an n^(th) individual distinct path signal is received, T(n), may be determined to be: t(n)≅t_(start)+(n−1)t_(off)  equation [2] In relation to the first moment time T_(fm), t_(start) may be expressed as: t_(start)≅T_(fm)−m·t_(off)  equation [3] where the variable, m, may represent a number of time offsets subsequent to a start of a delay spread wherein the first moment time is located.

The value for T(n) may then be expressed in relation to the first moment time: T(n)=T _(fm)+(in−m−1)t _(off)  equation [4]

As indicated in equation [4], given a first moment time, an offset, and a number of offsets subsequent to a start time for a delay spread, a time may be assigned to a plurality of group fingers in a CPP, in accordance with an embodiment of the present invention.

Determination of a detected energy level contained in a received signal cluster 106 may be based upon a time varying impulse response of an RF channel, h, which characterizes a transmission medium between the transmitter (for example, 102 in FIG. 1) and the mobile receiver (for example, 104 in FIG. 1). A relationship between a signal transmitted by a transmitter 102, x, and a signal received by a receiver 104, y, may be modeled:

$\begin{matrix} {{y\; k} = {{\sum\limits_{i = 0}^{L - 1}{{h_{k}(i)} \cdot {x\left( {{t_{k} - i}{\cdot t_{off}}} \right)}}} + n_{k}}} & {{equation}\mspace{14mu}\lbrack 5\rbrack} \end{matrix}$ where i may be utilized to reference an individual distinct path signal within the received signal cluster, h_(k) (i) may represent an i^(th) individual distinct path signal within the received signal cluster, k may represent a time instant, t_(off) may represent a time offset, n_(k) may represent noise that may be added to the received signal cluster, and L may represent a number of individual distinct path signals that are resolvable within a multipath. The number of individual distinct path signals that are resolvable within a multipath may correspond to a number of group fingers in a CPP in various embodiments of the present invention.

The receiver 104 may compute an estimate, h, of the time varying impulse response of the RF channel, h, based on the received signal, y, if the transmitter 102 transmits a known signal, contained within the transmitted signal x. This signal, which is contained within the transmitted signal x, may, for example, be referred to as a “pilot” signal, and may be utilized to compute estimates of the channel gain and RF phase across a delay spread of the channel. The computed estimate of the time varying impulse response h, which may represent an estimate that characterizes the transmission medium, may be referred to as a “channel estimate.” Based on the channel estimate, a detected energy level may be determined, based on the received signals in the cluster.

In various embodiments of the present invention, as a mobile receiver 104 changes its position relative to the transmitter 102, arrival times during which individual distinct path signals are received within a signal cluster may also change. Changes in the arrival times may be tracked based on a computed aggregate signal energy level for at least a portion of the received signal cluster 106. As a result of the tracking, a time correction may be applied to the first moment time T_(fm). The correction to the first moment time may result in a corresponding correction to the times T(n) that may be associated with individual cluster element in the CPP, as indicated in equation [4].

The plurality of group fingers (also referred to as “cluster elements” elements herein) may be modeled as a grid comprising a plurality of temporal points, say L, which are a fixed T_(BW) away from each other where T_(BW)=1/BW is known as the chip time (spread-spectrum communication systems). The grid points represent L-hypotheses of L input streams which has one chip-time delay from its neighbor point. The correctness of each of the hypotheses is measured by the correlation value associated with the grid point. The correlation is performed between the input and a synthesized pilot signal (that maintains the timing hypothesis at each point by creating a delay version matching the hypothesis delay). The set of the correlators output represents the estimate to the channel response −h.

The span time instants, T(n), n=0, L−1 in the delay spread, wherein individual elements in the grid of group fingers may be offset in time by a time increment that is approximately equal to the time offset t_(off). Thus, as the arrival time of the signal cluster 106 changes at the receiver 104, the grid may shift in time correspondingly. As stated above, the CPP cluster grid points maintain equal fixed time distance between all the grid points. This distance may be a chip time or less. The time tracking, therefore, of signals of a multipath is accomplished by accelerating or de-accelerating the reference signal. The delayed reference signal and its delayed copies continuously correlate with the in coming signal. The combined features of tracking a cluster of signals with a fixed grid alleviates numerous disadvantages that are shown in the conventional rake receiver. For example: eliminating the “fat finger”, the finger assigning/de-assigning cycle and a simplified energy and time reporting scheme based on the cluster as a whole.

The value of the time offset, t_(off), may be defined to ensure that it encompasses an amount of time required by the transmitter 102 to transmit a bit or symbol. In W-CDMA transmissions, an information signal, or “symbol”, may be spread or scrambled prior to transmission by utilizing scrambling, or spreading codes such as, for example, Gold codes, or orthogonal variable spreading factor (OVSF) codes. The scrambling, or spreading code may transform the symbol into a series of signals known as “chips” which may be transmitted as a W-CDMA spread spectrum signal. The time offset, t_(off), may be defined such that it encompasses the amount of time required to transmit the plurality of chips associated with a symbol. For example, if a transmitter 102 were to transmit chips at a “chip rate” of 3.84 Times.10⁶ chips/second, with each symbol comprising 16 chips, the time, ΔT, may be defined to be equal to (16/(3.84 Times.10⁶)) seconds, or approximately 4 microseconds.

In an exemplary embodiment of the present invention, a signal received by the receiver 104 includes a plurality of signal clusters. The plurality of signal clusters may originate from a single transmit antenna or from multiple transmit antennas. The plurality of transmit antennas may be located at a single BTS, or dispersed among a plurality of BTSs. The receiver 104 may be capable of receiving signals via a single antenna or a plurality of antennas. The receiver 104 may be adapted to track a time of arrival of multipath signals and may enable an efficient combining of individual distinct path signals within the multipath signals, into a single output represented as a pair of a complex signals comprising an in-phase component (I) and a quadrature phase component (Q). The receiver 104 may generate a received signal comprising a plurality of individual distinct path signals within a signal cluster, and may reduce overhead associated with managing and processing a plurality of individual distinct path signals in a multipath when compared to some conventional rake receivers.

Positioning of the group fingers of the CPP may be based timing information produced by a Delay Locked Loop (DLL), which provides a timing reference with respect to the transmitted signal. By using the DLL, the alignment of the group fingers may be established on a sub-chip-time basis. Selection of the sub-chip-time alignment may be performed to achieve maximal channel estimate energy for a particular plurality of individual distinct path signals upon which the CP operates. These operations will be described further herein with reference to FIGS. 8-10.

FIG. 2 is a block diagram illustrating an exemplary signal cluster preprocessor in a mobile receiver, in accordance with an embodiment of the present invention. Referring to FIG. 2, there is shown an antenna 202, a receiver front end block 204, a chip matched filter (CMF) block 206, a cluster path processor (CPP) block 208, and a searcher block 210.

The antenna 202 may comprise suitable logic, circuitry, and/or code that may be adapted to receive RF signals. The receiver front end block 204 may comprise suitable logic, circuitry, and/or code that may be adapted to receive RF signals as input and process the RF signals to a baseband frequency. The baseband frequency may be sampled digitally at a pre-determined rate sufficient for the bandwidth of the channel, and the sampled data may be the output of the receiver front end block 204. The CMF block 206 includes a pair of (I and Q) chip matched filters implemented by suitable logic, circuitry, and/or code that may be adapted to digitally filter the I and Q components of the signal received from the receiver front end block 204 utilizing a process that is matched to a corresponding process utilized by the transmitter. Specifically, the match filter is a square root raised cosine type. The received signal may also be band limited to a bandwidth of interest.

The CPP block 208 may comprise suitable logic, circuitry, and/or code that may be adapted to receive a digital signal and subsequently generate channel estimates, h, comprising an amplitude and phase representation of the complex components I and Q of each channel estimate component. The CPP block 208 may also generate a timing reference signal, T, based on the signal received from the CMF 206. An output signal from the block CPP block 208 may comprise channel estimates, and/or a timing reference signal. The CPP block 208 may also output a lock detect signal, L, that indicates whether the CPP block has locked upon incoming signal. The CPP block 208 provides these outputs to other receive path component(s) 212 of the mobile receiver. In other embodiments, the CPP block 208 extracts data from the incoming signal.

The searcher block 210 may comprise suitable logic, circuitry, and/or code that may be adapted to compute a first moment time T_(fm), in a received signal cluster. The searcher block 210 may detect a signal energy level that is associated with a plurality of received individual distinct path signals. The searcher block 210 may identify an individual distinct path signal that comprises a maximum signal energy level within a received signal cluster, and compute a corresponding arrival time at which the signal may be received at the receiver 104. The arrival time of the individual distinct path signal that comprises the maximum signal energy may represent the first moment time T_(fm). The searcher block 210 may compute a value, m, that represents a number of time offsets subsequent to a start of a delay spread wherein the first moment time is located. The searcher block 210 may also generate a plurality of Gold code parameters that are utilized in applying Gold codes to received individual distinct path signals 110, 112 and 114.

In operation, the antenna 202 may receive RF signals, which may be communicated to the receiver front end block 204. The receiver front end block 204 may process received RF signals by filtering, amplifying, and down-converting the RF signal to baseband frequency. The down-converted signal may be digitally sampled by an analog-to-digital converter at a pre-determined sampling rate. The digitally sampled signal may be the output of the receiver front end block 204, and this signal may be communicated to the CMF block 206. The CMF block 206 may perform digital band pass filtering on the baseband signal to limit the bandwidth of the signal received from the receiver front end 204. The band limited signal, comprising filtered signals I and Q, may be communicated to the searcher block 210 and the CPP block 208. The searcher block 210 may compute a first moment time, T_(fm), based on the input filtered I and Q signals, a number of time offsets, m, and a plurality of Gold code parameters. The values computed by the searcher block 210 may be communicated to the CPP block 208. The CPP block 208 may utilize the first moment time, number of time offsets, and Gold code parameters, received from the searcher block 210, to process the input filtered I and Q signal to generate output signals, which may be the complex phase and amplitude components of channel estimates that are computed, based on individual distinct path signals received at the antenna 202. The CPP block 208 may also generate timing reference signals. The generated channel estimate and timing signals may be outputs from the CPP block 208 and may be utilized to combine the various individual distinct path signals that are components in a received signal cluster.

FIG. 3 a is a block diagram of an exemplary cluster path processor (CPP), in accordance with an embodiment of the present invention. Referring to FIG. 3 a, there are shown the cluster path processors 300 and 350. The cluster path processor 300 may comprise a cluster tracker block 302, a timing control block 304, a local code generator block 306, a channel estimator block 308, a channel power block 310, a cluster moment generator block 312, and a Gold code TDL block 314. Input to the cluster path processor 300 may comprise the filtered signal from the CMF block 206 (FIG. 2), and first moment time, T_(fm), first moment offset, m, and Gold code parameters from the searcher block 210. The CPP 300 may output complex channel estimates h₁, and a timing reference signal T₁, while the CPP 350 may output complex channel estimates h₂, and a timing correction signal T₂.

Regarding the CPP 300, the cluster tracker block 302 may comprise suitable logic, circuitry, and/or code that may be adapted to track the location in time, or temporal location, of a received signal cluster. The cluster tracker block 302 may receive, as input, the filtered signal from the CMF block 206, a signal from the code generator 306, and a signal from the cluster moment generator 312. The filtered signal from the CMF block 206 may comprise a plurality of chips in a W-CDMA spread spectrum signal. The cluster tracker block 302 may utilize a descrambling code contained in the signal from the code generator 306 to perform descrambling on the filtered signal from the CMF block 206. The descrambling code may be applied to the filtered signal at a time, which may be based on a timing signal contained in an input signal from the cluster moment generator 312. The cluster tracker block 302 may generate a timing adjustment signal based on the result of the application of the descrambling code, from the code generator 306, to the filtered signal, wherein the application may be time-aligned based on the timing signal from the cluster moment generator 312. The generated output from the cluster tracker block 302 may be communicated to the timing control block 304.

The timing control block 304 may comprise suitable logic, circuitry, and/or code that may be adapted to monitor an arrival time of a signal cluster, and to generate a timing correction signal. The timing control block 304 may receive input, comprising a timing adjustment signal, from the cluster tracking block 302. Based on the input, the timing control block 304 may generate as output, a timing reference signal that indicates the temporal location of a received multipath signal. The timing reference signal generated by the timing control block 304 may be communicated to the code generator block 306 and to the channel estimator block 308. In addition, the timing reference signal may be an output from the cluster path processor 300 as the signal T₁.

The code generator block 306 may comprise suitable logic, circuitry, and/or code that may be adapted to generate time-aligned Gold codes, and/or orthogonal variable spreading factor (OVSF) codes, for example, serially at a defined rate. The code generator block 306 may receive input from the timing control block 304 that may be utilized to control a timing sequence in which Gold codes and/or OVSF codes are generated. The codes generated by the code generator block 306 may be communicated to the cluster tracker 302, and to the Gold Code TDL 314.

The channel estimator block 308 may comprise suitable logic, circuitry, and/or code that may be adapted to compute complex channel estimates comprising a representation of the complex components I and Q of each channel estimate component. The channel estimator block 308 may receive as input the filtered signal from the CMF block 206, and the timing signal from timing control block 304. In addition, the channel estimator block 308 may receive input from the Gold Code TDL 314. The channel estimator block 308 may utilize the descrambling, or despreading code from the Gold Code TDL 314, and the timing reference signal from the timing control block 304, to perform descrambling, or despreading on the filtered signal from the CMF block 206. The channel estimator block 308 may utilize the timing signal from the timing control block 304 to time-align the application of the descrambling code from the Gold Code TDL to the filtered spread spectrum signal from the CMF block 206. The descrambling operation may be identical to the correlation—mentioned before—that provides a metric that measure the validity of the timing of the Gold Code (WCDMA reference signal) at each of the cluster grid points. The metric may be identical to the channel response-h and the Gold Code is the reference signal transmitted. As a result of the descrambling process, the channel estimator block may extract pilot symbols contained within the received signal cluster. The channel estimator block 308 may then compute complex channel estimates, h_(k) (i), based on information contained in the pilot signals that are received across a duration comprising a delay spread.

In various embodiments of the present invention, the received pilot signals, comprising individual distinct path signals in a signal cluster, may be processed utilizing a grid comprising grid elements that generate a plurality of channel estimates, h_(k) (i), as described in equation [5]. Stating more generally, the information (chip pattern) that is transmitted within pilot signals, x, may be known at the receiver 104, and since the corresponding values of the signals received at the receiver, y, may also be known at the receiver, the values of the channel estimates h_(k) (i) may be computed by correlating x with y; provided x is uncorrelated with other signals in y. The complex channel estimate h₁, that is output from the CPP 300, may be represented as a vector that comprises at least a portion of a plurality of paths estimates h_(k) (i) computed in accordance with equation [5]. An individual path estimate h_(k) (i) may be computed for a corresponding grid element—i. In a grid that comprises L grid elements, at least a portion of a plurality of L channel estimates h_(k) (i) (i=0, L−1) may be contained in the vector representation h₁. The complex channel estimate h₂, that is output from the CPP 350, may correspondingly be represented as a vector that comprises at least a portion of a plurality of channel estimates h_(k) (i) computed in accordance with equation [5].

The channel power block 310 may comprise suitable logic, circuitry, and/or code that may be adapted to compute an aggregate radiated power level of the received signal cluster. The channel power block 310 may receive as input, channel estimates, h_(k) (i), from the channel estimator block 308. The channel power block 310 may utilize the received channel estimate, h_(k) (i), to compute a power level corresponding to each of the grid elements i. Thus, the channel power block 310 may compute a power level that corresponds to a received individual distinct path signal that is received at a time instant, T(n), wherein the received signal arrives at the receiver within a duration of a signal cluster. A time T(n) may be derived based on a received first moment time, T_(fm), as described in equation [4]. For a given channel estimate that corresponds to an i^(th) grid element, h_(k) (i), a channel power level may be based on a squared magnitude of the channel estimate and is computed: Power Level[ĥ_(k)(i)]≅∥ĥ_(k)(i)∥²  equation [6]

The power filter block 316, may comprise suitable logic, circuitry and/or code that computes a plurality of average values, avg{power level[ĥ_(k)(i)]}, for a corresponding plurality of values, power level [ĥ_(k)(i)], measured over a duration that is long compared to the duration of a delay spread. For example, the power filter block 316 may average power levels, power level [ĥ_(k)(i)], over duration of 10 milliseconds (ms).

Among the plurality of computed power levels, power level [ĥ_(k)(i)], the lock detect block 318, may apply a threshold function to the power levels that are computed by the average values generated by the power filter block 316. The threshold function may be utilized to generate a plurality of lock indicator signals, I_(k) (i), which indicate whether average values, avg{power level[ĥ_(k)(i)]}, generated by the power filter block 316 are less than a determined approximate threshold power level. For example, given threshold power levels, P_(thesh) _(—) _(high) and P_(thesh) _(—) _(low), the lock indicator signals (e.g., L₁) that may be output by the lock detect block 318 may be computed:

$\begin{matrix} {{l_{k}(i)} \cong \begin{Bmatrix} {{1\mspace{14mu}{for}\mspace{14mu}{{{\hat{h}}_{k}(i)}}^{2}} \geq P_{thresh\_ high}} \\ {{0\mspace{14mu}{for}\mspace{14mu}{{{\hat{h}}_{k}(i)}}^{2}} \geq P_{thresh\_ high}} \end{Bmatrix}} & {{equation}\mspace{14mu}\left\lbrack {7a} \right\rbrack} \end{matrix}$ if at least one of a preceding plurality of power levels, power level [ĥ_(j)(i)], has a value that is less than P_(thesh) _(—) _(low), and not one of the preceding plurality has a value that is greater than or equal to P_(thesh) _(—) _(high).

The computed lock indicator signals that may be output by the lock detect block 318 may be computed:

$\begin{matrix} {{l_{k}(i)} \cong \begin{Bmatrix} {{1\mspace{14mu}{for}\mspace{14mu}{{{\hat{h}}_{k}(i)}}^{2}} \geq P_{thresh\_ high}} \\ {{0\mspace{14mu}{for}\mspace{14mu}{{{\hat{h}}_{k}(i)}}^{2}} \geq P_{thresh\_ high}} \end{Bmatrix}} & {{equation}\mspace{14mu}\left\lbrack {7b} \right\rbrack} \end{matrix}$ if at least one of a preceding plurality of power levels, power level[ĥ_(j)(i)], has a value that is greater than, or equal to P_(thesh) _(—) _(high), and not one of the preceding plurality has a value that is less than P_(thesh) _(—) _(low).

The plurality of lock indicator signals, I_(k) (i), may be communicated, by the lock detect block 318, to the channel estimation gate block 320. The plurality of lock indicator signals, I_(k) (i), may be also communicated as outputs from the CPP 300.

The channel estimation gate block 320 may comprise suitable logic, circuitry, and/or code to select, from a received plurality of channel estimates, ĥ_(k) (i), at least a portion of the received plurality that comprise values that are determined to be valid based on a corresponding received plurality of lock indicator signals I_(k) (i). The channel gate block 320 may generate a channel estimate vector, ĥ₁, comprising a plurality output channel estimates, output [ĥ_(k)(i)], according to:

$\begin{matrix} {{{Output}\mspace{14mu}\left\lbrack {{\hat{h}}_{k}(i)} \right\rbrack} \cong \begin{Bmatrix} {{{{\hat{h}}_{k}(i)}{\mspace{11mu}\mspace{11mu}}{for}\mspace{14mu} 1_{k}(i)} = 1} \\ {{0\mspace{14mu}{for}\mspace{14mu} 1_{k}(i)} = 0} \end{Bmatrix}} & {{equation}\mspace{14mu}\lbrack 8\rbrack} \end{matrix}$ where the channel estimate vector, h₁, comprises a plurality of values output[ĥ_(k)(i)], and k comprises a range of values from 0 to L−1 corresponding to each of the plurality of grid elements spanning a delay spread in the received signal cluster.

The cluster moment generator block 312 may comprise suitable logic, circuitry, and/or code that may be adapted to perform a first moment calculation based on a received plurality of computed power levels, power level[ĥ_(k)(i)] from the channel power block 310, and a first moment offset, m, from the searcher block 210. Based on this information, the cluster moment generator 312 may compute an aggregate power level for at least a portion of the received signal cluster that comprises individual distinct path signals measured at time instants T(n) for n<m, Pwr_E_(k). The cluster moment generator 312 may compute a subsequent aggregate power level for at least a portion of the received signal cluster that comprises distinct path signals measured at time instants T(n) for n>m, Pwr_L_(k). The aggregate power levels, Pwr_E_(k) and Pwr_L_(k), may be communicated to the cluster tracker block 302.

The Gold Code TDL block 314 may comprise suitable logic, circuitry, and/or code that may delay the application of descrambling and/or dispreading codes, for example, Gold codes and OVSF codes. The Gold Code TDL block 314 may receive as input, descrambling codes generated by the code generator block 306. The Gold Code TDL 314 may utilize a code tracking loop to regenerate the received scrambling codes for each of the time instants T(n) that span the delay spread associated with the received signal cluster. A corresponding grid of scrambling code elements 0, . . . , L−1 may be communicated to the channel estimator block 308.

In operation, filtered W-CDMA spread spectrum signals from the CMF block 206 containing a plurality of pilot signals from multiple base transceiver stations, may be communicated to an input of a plurality of cluster processor blocks within 208. Since information communicated in the transmitted pilot signals sent from the multiple BTS is the same, each BTS may scramble the pilot signal utilizing a unique Gold code. The cluster tracker block 302 may also receive as inputs an output generated by the code generator block 306, and an output generated by the cluster moment generator block 312. The input to the cluster tracker 302 from the code generator block 306 may comprise a descrambling code that was generated based on timing information derived from a previously received individual distinct path signal. The input from the cluster moment generator block 312 may comprise an error signal that was computed in accordance with equation [9]. The cluster tracker block 302 may utilize the input from the code generator block 306 to descramble the filtered signal from the CMF block 206. The descrambling code received from the code generator block 306 may be applied to the filtered signal from the CMF block 206 at a time instant based on the error signal received from the cluster moment generator block 312.

The cluster tracker block 302 may generate an error signal, error_(k), based on a difference between aggregate power levels received from the cluster moment generator block 312:

$\begin{matrix} {{Error}_{k} \cong {{\sum\limits_{i = 0}^{m - 1}{{{\overset{̑}{h}}_{k}(i)}}^{2}} - {\sum\limits_{i = {m + 1}}^{L - 1}{{{\overset{̑}{h}}_{k}(i)}}^{2}}}} & {{equation}\mspace{14mu}\lbrack 9\rbrack} \end{matrix}$ where L may represent the number of grid elements that is contained within a delay spread for the received signal cluster. The first term on the right hand side of equation [9] may represent the aggregate power level, Pwr_E_(k), that was computed by the cluster moment generator 312. The second term on the right hand side of equation [9] may represent the aggregate power level, Pwr_L_(k), that was computed by the cluster moment generator 312.

In operation, a current computed error signal, error_(k), computed for a current signal cluster at a current time instant, k, may differ in value in comparison to a corresponding subsequent computed error signal, error_(p), computed for a subsequent signal cluster at a subsequent time instant, p.

The cluster tracker 302 may perform an averaging of a plurality of computed error signals, error_(k), over a duration that is long compared to the duration of a delay spread, 10 ms, for example. An averaged error signal, avg(error_(k)), may represent a weighted average error signal based on a current computed error signal, error_(k), and a plurality of preceding computed error signals, error_(q), where q is not equal to k. The averaged error signal value may be thresholded, and the averaged error signal value may be utilized to generate a timing adjustment signal. If a magnitude of the averaged error signal value is less than a threshold value, T_(adj), the timing adjustment signal may be set to a value of 0. For magnitudes of the averaged error signal value that are greater than T_(adj) the timing adjustment signal may be set to a value in accordance with receiver timing resolution, and sign of accumulated error signal error_(k).

The averaging of error signals, error_(k), computed by the cluster tracker 302 may isolate changes in individual error signals, error_(k), from temporary changes in the timing adjustment signal that is generated by the cluster tracker 302. In turn, this may enhance the stability of time tracking of received signal clusters in various embodiments of the present invention. To further enhance the stability of operation in various embodiments of the present invention, the magnitude of the averaged error signal value, avg(error_(k)), may be thresholded to avoid generation of timing correction signals for averaged error signal values that are too small, for example a summation value that is less than a chip time. The timing adjustment signal may be communicated to the timing control block 304.

The timing control block 304 may utilize the timing adjustment signal from the cluster tracker block 302 to generate a set of timing reference signals T₁, which may represent, for example, be a locally generated code boundary or period. This timing reference signal may also be communicated to the code generator block 306, and to the channel estimator block 308. In addition, the timing reference signal may be an output from the cluster path processor 300 as the set of signals T₁.

A time corrected first moment time, T′_(fm), may be generated by the timing control block 304 that represents a time correction of the first moment time, T_(fm), that was received from the searcher block 210. The time corrected first moment time, T′_(fm), may be expressed: T¹ _(fm)−T_(fm)−Error  equation [10] where the error term is based on the timing adjustment signal received from the cluster tracker 302.

If the received first moment time, T_(fm), represents a time instant corresponding to a center time for signal energy in the received signal cluster, the error term may be approximately equal to 0. Thus, the time corrected first moment time, T′_(fm), as computed based on equation [10], may be approximately equal to the first moment time, T_(fm), that was received from the searcher block 210. The grid, in this case, may be in proper time alignment to track the received signal cluster and values of T(n) that correspond to time instants associated with each grid element may be computed in accordance with equation [4].

If the first moment time represents a time instant that occurs before the center time for signal energy in the received signal cluster, the error term, as computed in accordance with equation [9], may comprise a numerical value that is less than 0. In the case of a negative error term, the time corrected first moment time, T′_(fm), as computed in accordance with equation [10], may comprise a value that is greater than the value of the first moment time, T_(fm), that was received from the searcher block 210. The grid, in this case, may not be in proper time alignment to track the received signal cluster. Accordingly, values of T(n) that correspond to time instants associated with each grid element may be computed in accordance with equation [11]: T(n)≅T¹ _(fm)+(n−m−1)t_(off)  equation [11]

If the first moment time represents a time instant that occurs after the center time for signal energy in the received signal cluster, the error term, as computed in accordance with equation [9], may comprise a numerical value that is greater than 0. In the case of a positive error term, the time corrected first moment time, T′_(fm), as computed in accordance with equation [10], may comprise a value that is less than the value of the first moment time, T_(fm), that was received from the searcher block 210. The grid, in this case, may not be in proper time alignment to track the received signal cluster and values of T(n) that correspond to time instants associated with each grid element may be computed in accordance with equation [11].

The timing control block 304 may perform averaging of a plurality of received timing adjustment signals. The averaging of the timing adjustment signals may isolate changes in the timing reference signals, T₁, from temporary changes in the timing adjustment signal that is received from the cluster tracker 302. In turn, this may enhance the stability of time tracking of received signal clusters in various embodiments of the present invention.

The code generator block 306 may receive the timing reference signals, T₁, from the timing control block 304. Based on the timing signal, T₁, the code generator 306 may serially generate descrambling Gold codes and/or despreading OVSF codes. The code generator block 306 may receive inputs from the searcher block 210 comprising a searcher position indication, and code identification. The searcher position identification may comprise information that indicates to the code generator 306 a start time, t_(start), indicating a time instant for the arrival of the first individual distinct path signal in a received signal cluster. The code identification may comprise information that may be utilized by the code generator block 306 to determine a code sequence to generate. The code sequences, also referred to as codes, generated by the code generator block 306 may be communicated to the cluster tracker block 302 and to the Gold Code TDL block 314.

The Gold Code TDL block 314 may receive as an input the Gold codes output by the code generator block 306. The Gold Code TDL block 314 may delay these codes such that the application of the despreading code on a chip at the receiver may be in precise time-alignment with the application of the spreading code on the corresponding symbol at the transmitter. The time-aligned despreading codes may be output from the Gold Code TDL communicated to the channel estimator block 308.

The timing reference signals, T₁, from the timing control block 304 may comprise a timing reference that is utilized for subsequent processing in a mobile receiver, for example, processing based on maximum ratio combining (MRC), or dispreading. The Gold Code TDL block 314 may further refine this estimate to generate a time-aligned version of the Gold code that may be accurate to within approximately 1 chip time unit of a true value of the first moment time, T_(fm), for the received signal cluster.

In operation, a current computed power level [h_(k) (i)] associated with an individual distinct path signal in a current signal cluster at a current time instant, k, may differ in value in comparison to a corresponding subsequent computed power level [ĥ_(p) (i)] associated with an individual distinct path signal in a subsequent signal cluster at a subsequent time instant, p.

The averaging performed by the power filter block 316 may enable the CPP 300 to isolate changes in the values of output channel estimates, h₁, from temporary fluctuations in channel estimate values, ĥ_(k)(i), that are detected within the CPP 300. Consequently, various embodiments of the present invention may enable the implementation of rake receiver designs that achieve stable performance level over a plurality of received signal clusters.

The plurality of lock indicator signals, I_(k) (i), generated by the lock detect block 318 may be utilized to determine if the corresponding channel estimate ĥ_(k)(i) comprises a value that is valid. If one of the plurality of lock indicator signals, I_(k) (i), is equal to 1, the corresponding channel estimate value, h_(k) (i), may comprise a valid value. If one of the plurality of lock indicator signals, I_(k) (i), is equal to 0, the corresponding channel estimate value, h_(k) (i), may not comprise a valid value. Values of ĥ_(k)(i) that are invalid may be discarded.

Similarly, the cluster path processor, 350, may receive as input the filtered data from the CMF block 206, and may generate as outputs channel estimates, ĥ₂, and a timing correction signals, T₂. The cluster path processor 350 may be adapted to receiving individual distinct path signals which are transmitted by a separate antenna from the antenna utilized to transmit individual distinct path signals that are received by the processor 300.

In various embodiments of the present invention, the cluster path processor 300 may correct timing errors wherein a signal cluster is not received in accordance with a received first moment time by computing an error term, in accordance with equation [9]. The error term may be utilized to apply a time correction to the received first moment time, and to subsequently generate a time corrected first moment time. A grid, comprising a plurality of grid elements, each comprising a correlator, that process a received plurality of individual distinct path signals at time instants, T(n) computed in accordance with equation [4], may be shifted in time to track the received signal cluster based on an error term computed in accordance with equation [9]. The time tracking for the received signal cluster may be achieved based on a single first moment time, or time corrected first moment time. In some conventional rake receivers, time tracking of a plurality of L individual distinct path signals may comprise a corresponding plurality of L independent time tracking decisions. In various embodiments of the present invention, time tracking of a plurality of L individual distinct path signals may comprise a single time tracking decision based on either a first moment time, or a time corrected first moment time. The first moment time, or the time corrected first moment time, may be computed based on an aggregate signal energy level as measured across a duration comprising the delay spread of a received signal cluster.

The CPP 300 may include a Delay Locked Loop (DLL) 352 that provides timing references for various of the elements of the CPP 300, e.g., cluster tracking block 302, timing control block 304, channel estimator 308, etc. Of course, the DLL 352 may provide timing references to other of the components of the CPP 300 also/alternatively. Generally, the DLL 352 is used to align a plurality of group fingers of the CPP 300. Such alignment may be on a course level to align the plurality of group fingers of the CPP 300 with respect to a plurality of individual distinct path signals in a signal cluster that is received within a duration comprising a delay spread. Further such alignment may be on a fine level as well, such as a sub-chip-level alignment when the plurality of group fingers are spaced on a chip-level basis. The manner in which these operations are accomplished is described further with reference to FIGS. 7-10.

FIG. 3 b is a block diagram of an exemplary channel estimation operation in the CPP, in accordance with an embodiment of the present invention. With reference to FIG. 3 b there is shown a plurality of filter blocks 321, 322, 323, . . . , 324, a plurality of complex multiplication blocks 325, 326, 327, . . . , 328, and a plurality of delay blocks 329, 330, . . . , 331. The delay blocks 329, 330, . . . , 331, may comprise suitable logic, circuitry and/or code that may be adapted to store a time delayed version of a received input signal. The complex multiplication blocks 325, 326, 327, . . . , 328, may comprise suitable logic, circuitry, and/or code to perform a convolution based on received input signals. The filter blocks 321, 322, 323, . . . , 324, may comprise suitable logic, circuitry, and/or code to compute a channel estimate based on a received input signal.

In operation, a locally generated code, gc_(k), for example Gold codes may be generated in association with a grid comprising a corresponding plurality of L grid elements that span a delay spread, achieved by a plurality of delay blocks. At a time instant, a current code, and preceding L−1 previously generated codes are utilized by a corresponding complex multiplication blocks 325, 326, 327, . . . , 328. The convolver blocks 325, 326, 327, . . . , 328 may perform a convolution utilizing a corresponding current and/or time delayed code, and a received signal cluster rx_(k). The received signal cluster may be received from a CMF block 206. The convolution performed by the complex multiplication blocks 325, 326, 327, . . . , 328 may produce a plurality of descrambled and/or despread signals. The filter blocks 321, 322, 323, . . . , 324 may compute corresponding channel estimates, ĥ_(k)(i), across the grid utilizing a corresponding plurality of descrambled and/or despread signals.

FIG. 3 c is a block diagram of an exemplary cluster tracker operation, in accordance with an embodiment of the present invention. With reference to FIG. 3 c there is shown a plurality of summing blocks 332, 333, and 334, a multiplier block 335, a delay block 336, a switching block 337, and a threshold block 338. The summing blocks 332, 333, 334 may comprise suitable logic, circuitry, and/or code to generate an output signal based on a sum of received input signals. The multiplier block 335 may comprise suitable logic, circuitry, and/or code that may generate an output signal that comprises a version of an input signal that is scaled according to an input scale factor. The delay block 336 is as described for the plurality of delay blocks 329, 330, . . . , 331. The switching block 337 may comprise suitable logic, circuitry, and/or code that may generate an output signal that comprises a selected one of a plurality of input signals based on a selector input signal. The threshold block 338 may comprise suitable logic, circuitry, and/or code that may compare a value of an input signal to a threshold value. An output signal may be generated based on the comparison.

In operation the summing block 332 may receive computed aggregate power levels, Pwr_E_(k) and Pwr_L_(k). The summing block 332 may compute a sum that comprises an error value e_(k). The error signal may be driven to zero by providing timing adjustments to the grid position to ensure that statistical average is approximately equal to 0. The mechanism utilized in this operation may comprise a closed loop, in which timing adjustments affect the corresponding channel and power estimates. The multiplier block 335 may scale the error value e_(k), based on a scale factor kp, to generate a scaled error approximately equal to kpe_(k). The summing block 334 may generate a second sum comprising the sum and a time delayed output from the switch 337. The output of the switch 337 may be approximately equal to either a previously generated second sum, or the value 0 based on a value of the rst_cntrl input. The summing block 333 may generate a third sum comprising the scaled sum and the second sum. The threshold block 338 may compare a magnitude of the value of the third sum with a threshold value. A time adjustment signal ΔT_(k) may be generated by the threshold block 338. The final output ΔT_(k) may be output to the timing control block 304 which may be integrated to generate a timing estimate. A timing correction may be positive, negative, or 0. The timing control operation may integrate the output. If the value of the third sum does not exceed the threshold value, ΔT_(k) may be equal to 0.

FIG. 3 d is a block diagram of an exemplary timing control operation, in accordance with an embodiment of the present invention. With reference to FIG. 3 d there is shown a summing block 339, a delay block 340, and a modern timing reference block 341. The summing block 339 is as described for the plurality of summing blocks 332, 333, 334. The delay block 336 is as described for the plurality of delay blocks 329, 330, . . . , 331. The modern timing reference block 341 may comprise suitable circuitry, logic, and/or code to generate a timing reference signal.

In operation, the timing reference may be utilized in a mobile receiver. The timing control operation may comprise integrating a timing correction signal ΔT_(k) received from the cluster tracker operation, as described in FIG. 3 c, based on the loop formed by the summing block 339 and the delay block 340. The modern timing reference block 341 may also utilize a reference clock that is derived from a main oscillator.

FIG. 4 is an exemplary diagram illustrating various aspects of signal clusters, in connection with an embodiment of the present invention. Referring to FIG. 4, there is shown a timing diagram of two signal clusters 402, and 404, each comprising a plurality of individual distinct path signals. The signal cluster 402 may arrive at a mobile receiver at a time instant t_(start0). The time t_(start0) may correspond to a time of arrival for a first individual distinct path signal in the signal cluster 402. Within the signal cluster 402, a plurality of individual distinct path signals associated with the signal cluster 402, may arrive within a time duration, comprising a delay spread, subsequent to the time instant t_(start0). The first moment time associated with the signal cluster 402 may correspond to a time instant t₀. A time offset between arrival of an n^(th) individual distinct path signal, and an (n+₁)^(th) individual distinct path signal may correspond to a time offset t_(off).

The signal cluster 404 may arrive at a mobile receiver at a time instant t_(start1). The time t_(start1) may correspond to a time of arrival for a first individual distinct path signal in the signal cluster 404. Within the signal cluster 404, a plurality of individual distinct path signals associated with the signal cluster 404, may arrive within a time duration, comprising a delay spread, subsequent to the time instant t_(start1). The first moment time associated with the signal cluster 404 may correspond to a time instant t₁. A time offset between arrival of an n^(th) individual distinct path signal, and an (n+1)^(th) individual distinct path signal may correspond to a time offset t_(off) as indicated for the signal cluster 402.

The signal clusters 402, 404 may have been transmitted by distinct transmitting antennas, which may have been located at distinct base transceiver stations 102, for example. When compared to signal 402, the signal 404 may have experienced a longer path to arrive at a receiving antenna 202 in a mobile receiver 104. The signal clusters 402, 404, may be individually processed by the cluster path processors, 300 and 350 respectively, in FIG. 3 a, for example.

In an illustrative embodiment of the present invention, the cluster path processors 300 and 350 may be utilized when receiving multipath signals from a BTS that transmits signals from 2 antennas. This mode of operation may be referred to as space time transmit diversity (STTD), which may support receiving modes closed loop 1 (CL1), and closed loop 2 (CL2) as defined by the W-CDMA standard. Alternatively, in a mode of operation, which may be referred to as “macro” diversity, the cluster path processors 300 and 350 may receive multipath signals from separate BTS, each of which may transmit multipath signals from a single antenna.

FIG. 5 a is a graph that illustrates exemplary cluster moment calculations for a fully acquired signal cluster, in accordance with an embodiment of the present invention. With reference to FIG. 5 a there is shown an exemplary received signal cluster 502. The profile of the signal cluster 502 shows signal energy, E(k), as a function of relative time where relative time may be measured in relation to an expected arrival time of a signal cluster at a mobile receiver. A BTS may transmit a plurality of signal clusters to a mobile receiver where the time between a start of transmission of an n^(th) signal cluster, and a start of transmission of an (n+1)^(th) signal cluster may be defined, in transmission time, as Δ. Relative time may be measured within a Δ time interval. A delay spread associated with the signal cluster is shown to be approximately 4 relative time units. The time offset is shown to be approximately 0.5 relative time units. In the exemplary signal energy profile of FIG. 5 a, the corresponding first moment time, T_(fm), is approximately 2 relative time units. The corresponding first moment offset, m=4. The start time, t_(start), associated with the received signal cluster may be 0 relative time units. The grid may comprise 9 grid elements, thus L=9 in this example. The time instants T(n) corresponding to each of the grid elements may be represented as follows:

$\begin{matrix} {{T(n)} \cong \frac{n - 1}{2}} & {{equation}\mspace{14mu}\lbrack 12\rbrack} \end{matrix}$ where n may be a counting number comprising a range of values from 1 to 9 inclusive, for example. The value T(n) may represent a relative time, that is associated with the n^(th) grid element, within the delay span of a received signal cluster.

As shown in FIG. 5 a, the entire signal cluster 502 may lie within a temporal region of observation of the cluster path processor grid. The received signal cluster may, therefore, be considered as being “fully acquired.” The characteristics of the received signal cluster may be: E(k)≅k(for 0≦k≦2)  equation [13a] E(k)≅4−k(for 2≦k≦4)  equation [13b] where k represents time instants, measured in relative time units, at which individual distinct path signals may be received where k may comprise an approximate range of values comprising (0, ½, 1, 1½, 2, 2½, 3, 3½, 4). E(k) may represent a received signal energy level measured at a time instant k.

The cluster moment generator 312 may compute corresponding aggregate power levels:

$\begin{matrix} \begin{matrix} {{Pwr\_ E}_{k} \cong {\sum\limits_{k = 0}^{1.5}k^{2}}} \\ {\cong {0.25 + 1 + 2.25}} \\ {= 3.5} \end{matrix} & {{equation}\mspace{14mu}\left\lbrack {14a} \right\rbrack} \\ \begin{matrix} {{Pwr\_ L}_{k} \cong {\sum\limits_{k = 2.5}^{4}\left( {4 - k} \right)^{2}}} \\ {\cong {0.25 + 1 + 2.25}} \\ {= 3.5} \end{matrix} & {{equation}\mspace{14mu}\left\lbrack {14b} \right\rbrack} \end{matrix}$

The cluster tracker may compute an error term:

$\begin{matrix} \begin{matrix} {{Error}_{k} \cong {{\sum\limits_{k = 0}^{1.5}k^{2}} - {\sum\limits_{k = 2.5}^{4}\left( {4 - k} \right)^{2}}}} \\ {\cong {3.5 - 3.5}} \\ {= 0} \end{matrix} & {{equation}\mspace{14mu}\lbrack 15\rbrack} \end{matrix}$

In the example of FIG. 5 a, the grid may be time aligned with the received signal cluster. Corresponding there may be no timing adjustment applied to the first moment time T_(fm).

FIG. 5 b is a graph that illustrates exemplary cluster moment calculations for a partially acquired signal cluster, in accordance with an embodiment of the present invention. With reference to FIG. 5 b there is shown an acquired portion of a transmitted signal cluster 504, and a non-acquired portion of a transmitted signal cluster 506. The received signal cluster shown in FIG. 5 a may have been received by a mobile terminal, but due to a change in the position of the mobile terminal relative to the transmitter, the profile of the acquired portion of signal cluster may have changed as shown in FIG. 5 b. Because of the relative time shift in the arrival, at the mobile receiver, of the received signal cluster, the cluster path processor grid may capture only a portion of the signal energy, E(k), in the transmitted signal cluster, comprising 504 and 506. A non-acquired portion of the transmitted signal cluster, 506, may lie outside of the region of signal acquisition. Thus, in FIG. 5 b the characteristics of the acquired signal cluster 504 may be: E(k)≅0(for 0≦k≦2)  equation [16a] E(k)≅k−2(for 2≦k≦4)  equation [16b]

The cluster moment generator 312 may compute corresponding aggregate power levels: Pwr_E_(k)≅0  equation [17a]

$\begin{matrix} \begin{matrix} {{Pwr\_ L}_{k} \cong {\sum\limits_{k = 2.5}^{4}\left( {k - 2} \right)^{2}}} \\ {\cong {0.25 + 1 + 2.25 + 4}} \\ {= 7.5} \end{matrix} & {{equation}\mspace{14mu}\left\lbrack {17b} \right\rbrack} \end{matrix}$

The cluster tracker may compute an error term:

$\begin{matrix} \begin{matrix} {{Error}_{k} \cong {\sum\limits_{k = 2.5}^{4}\left( {k - 2} \right)^{2}}} \\ {\cong {0 - 7.5}} \\ {\cong {- 7.5}} \end{matrix} & {{equation}\mspace{14mu}\lbrack 18\rbrack} \end{matrix}$

In the example of FIG. 5 b, the grid may not be time aligned with the received signal cluster. A timing adjustment may be applied correspondingly to the first moment time T_(fm).

FIG. 6 is an exemplary flow diagram illustrating cluster path processing of a received signal cluster, in accordance with an embodiment of the present invention. With reference to FIG. 6 step 602 describes inputs utilized by the CPP 300 that include a searcher position, a code ID, and a first moment offset. In step 604 a timing adjustment may be computed based on a received filtered signal from the CMF block 206, a generated code, and computed signal cluster energy levels. In step 606 a timing reference signal may be generated based upon the timing adjustment signal generated in step 604. The timing reference signal may be output from the cluster path processor as output signal T₁. In step 608 a Gold code may be generated at a time instant in accordance with the timing reference signal generated in step 606. In step 610, the Gold code may be regenerated at distinct time instants within a duration of a delay spread. In step 612, channel estimates may be generated based on the received filtered signal from the CMF block 206, timing reference signal generated in step 606, and Gold codes generated in step 610. In step 614 channel estimates computed in step 612 may be utilized to compute signal channel power. In step 616 the channel power, computed in step 614, may be utilized to compute aggregate signal power levels, Pwr_E_(k) and Pwr_L_(k), for at least a portion of the received signal cluster. In step 624, an error term, error_(k), may be computed based on the aggregate signal power levels computed in step 616.

In step 618, the channel power computations from step 614 may be thresholded. In step 620, channel estimates computed in step 612 may be selected based on the results of the thresholding of step 618. The selected channel estimates may be output from the cluster path processor as output signal h₁. In step 622 corresponding lock indicators may be generated that indicate the channel estimates selected in step 620. The lock indicators may be output from the cluster path processor as output signal L₁.

FIG. 7 is an exemplary diagram illustrating various aspects of signal clusters having overlapping delay spreads in connection with an embodiment of the present invention. Referring to FIG. 7, there is shown a timing diagram of two signal clusters 702, and 704, each comprising a plurality of individual distinct path signals. The signal cluster 702 may arrive at a mobile receiver at a time instant t_(start0). The time t_(start0) may correspond to a time of arrival for a first individual distinct path signal in the signal cluster 702. Within the signal cluster 702, a plurality of individual distinct path signals associated with the signal cluster 702, may arrive within a time duration, comprising a delay spread 706, subsequent to the time instant t_(start0). The first moment time associated with the signal cluster 702 may correspond to a time instant t₀. A time offset between arrival of an n^(th) individual distinct path signal, and an (n+₁)^(th) individual distinct path signal may correspond to a time offset t_(off).

The signal cluster 704 may arrive at a mobile receiver at a time instant t_(start1). The time t_(start1), may correspond to a time of arrival for a first individual distinct path signal in the signal cluster 704. Within the signal cluster 704, a plurality of individual distinct path signals associated with the signal cluster 704, may arrive within a time duration, comprising a delay spread 708, subsequent to the time instant t_(start1). The first moment time associated with the signal cluster 704 may correspond to a time instant t₁. A time offset between arrival of an n^(th) individual distinct path signal, and an (n+1)^(th) individual distinct path signal may correspond to a time offset t_(off) as indicated for the signal cluster 702.

The signal clusters 702, 704 may have been transmitted by distinct transmitting antennas, which may have been located at distinct base transceiver stations 102, for example. When compared to signal 702, the signal 704 may have experienced a longer path to arrive at a receiving antenna 202 in a mobile receiver 104. The signal clusters 702, 704, may be individually processed by the cluster path processors, 300 and 350 respectively, in FIG. 3 a, for example.

As contrasted to the example of FIG. 4, the signal clusters 702 and 704 overlap in time. This type of signal cluster overlap 702 and 704 may be present in a Pedestrian-B (PEDB) channel, for example. Because these signal clusters 702 and 704 overlap in a closely spaced multi-path environment, there exists interference among the multi-path components of the signal clusters 702 and 704. The early and later energy of one path may be captured from two adjacent paths, resulting in on-time sampling error and sampling jitter. Because the CPPs operate in an attempt to extract the most signal energy from the received signals that are distributed among multi-paths, a maximum energy criterion for equally chip spaced group fingers is employed according to the present invention to determine a fine sampling position that maximizes the Signal to Noise Ratio (SNR) of the combined channel estimates of the CPP combiner.

FIG. 8 is an exemplary diagram illustrating various aspects of the signal clusters 702 and 704 of FIG. 7 showing the coarse alignment of group fingers of a CPP of an embodiment of the present invention. Generally, according to one embodiment, a searcher of the CPP detects a maximum signal energy level and position of at least one of a plurality of individual distinct path signals in a signal cluster. As was previously described, at least a portion of the plurality of individual distinct path signals is received within a duration of a corresponding delay spread.

The CPP includes a group finger array having a plurality of group fingers 802. According to one aspect of the present invention, the CPP is operable to determine a coarse sampling position of the group finger array 802 based upon the position of the at least one of a plurality of individual distinct path signals in the signal cluster. This coarse alignment is shown in FIG. 8. Note that the alignment of the plurality of group fingers 802 overlaps a portion of the signal cluster 702 and overlaps all of signal cluster 704. Of course in other examples the plurality of group fingers may more than fully (or partially) overlap the signal cluster 704.

FIG. 9 is an exemplary diagram illustrating various aspects of the signal clusters 702 and 704 of FIG. 7 showing the fine alignment of group fingers of a CPP of an embodiment of the present invention. According to an embodiment of the present invention, for each of a plurality of fine sampling offsets, the CPPs determine a composite channel energy estimate for the plurality of individual distinct path signals. The CPP then selects a fine sampling offset based upon a corresponding maximum composite channel energy estimate. Further, the CPP determines a sampling position for the group finger array 802 based upon the coarse sampling position and the selected fine sampling offset. Then, the CPP or other receiver components receives at least a portion of the plurality of individual distinct path signals by the group finger array at a corresponding plurality of time instants based upon the determined sampling position.

According to one operation of the present invention, the CPP, in selecting the fine sampling offset based upon a corresponding maximum composite channel energy estimate characterizes the relationship between a composite channel energy estimate and fine sampling offset. The CPP then selects a fine sampling offset that corresponds to a zero differential of the relationship between composite channel energy estimate and fine sampling offset. In one particular implementation of this technique, in selecting the fine sampling offset based upon a corresponding maximum composite channel energy estimate, the CPP is operable to implement the equation:

$\begin{matrix} {{{\frac{\mathbb{d}}{\mathbb{d}ϛ}{P(ϛ)}} \propto {\sum\limits_{i = {locked}}{{h_{i}^{*}(ϛ)}\frac{{h_{i}\left( {ϛ + \Delta} \right)} - {h_{i}\left( {ϛ - \Delta} \right)}}{2\Delta}}}} = 0} & {{equation}\mspace{14mu}\lbrack 19\rbrack} \end{matrix}$ when Δ→0, where P(ζ) represents the composite channel energy estimate and h_(i) represents a channel estimate value. In doing so to determine the fine sampling offset, the CPP 300 may implement equation [20].

$\begin{matrix} {P_{\Delta} = {\sum\limits_{i \in {locked}}{{Re}\left( {{R_{h_{i}}^{*}(ϛ)}\left( {{R_{h_{i}}\left( {ϛ + \Delta} \right)} - {R_{h_{i}}\left( {ϛ - \Delta} \right)}} \right)} \right)}}} & {{equation}\mspace{14mu}\lbrack 20\rbrack} \end{matrix}$ where R_(h) _(i) is the correlation value of a pilot channel at the i-th group finger of the CPP 300. In Equation, only a linear operation is required. Thus, using equation [20], two pilot channel correlations are required to realize on-time channel estimation related to R_(h) _(i) *(ζ) and early-lag differences (R_(h) _(i) (ζ+Δ)−R_(h) _(i) (ζ−Δ)). Another criterion can be employed as equation [21]. In this case, a total of three pilot channel correlations are needed for each locked CPP group finger including an on-time channel estimation related to R_(h) _(i) *(ζ) and an early-lag difference.

$\begin{matrix} {P_{\Delta} = {\sum\limits_{i \in {locked}}\left( {{{R_{h_{i}}\left( {ϛ + \Delta} \right)}}^{2} - {{R_{h_{i}}\left( {ϛ - \Delta} \right)}}^{2}} \right)}} & {{equation}\mspace{14mu}\lbrack 21\rbrack} \end{matrix}$

According to one aspect of the description of FIG. 9, the plurality of individual distinct path signals in the signal cluster comprise spread spectrum signals and a temporal distance between group fingers of the group finger array of the CPP corresponds to a chip duration T_(c) of the plurality of individual distinct path signals in the signal cluster. This temporal distance is shown in FIG. 9 as indicated. Further indicated in FIG. 9 is the fine adjustment value ζ and its relationship to the chip duration T_(c) separation between the group fingers of the CPP. In the example of FIGS. 8 and 9, the plurality of group fingers comprises 16 group fingers.

FIG. 10 is an exemplary flow diagram illustrating the fine alignment of group fingers in conjunction with cluster path processing of a received signal cluster, in accordance with an embodiment of the present invention. Operation 1000 commences with detecting a maximum signal energy level of at least one of a plurality of individual distinct path signals in a signal cluster (Step 1002). According to the operation of Step 1002, at least a portion of the plurality of individual distinct path signals are received within a duration of a corresponding delay spread. Operation continues with determining a coarse sampling position of a group finger array based upon a position of the maximum signal energy level of the at least one of a plurality of individual distinct path signals in a signal cluster (Step 1004). The group finger array including a plurality of group fingers

Operation continues with, for each of a plurality of fine sampling offsets, determining a composite channel energy estimate for the plurality of individual distinct path signals (Step 1006). The, operation includes selecting a fine sampling offset based upon a corresponding maximum composite channel energy estimate (Step 1008). Next, operation includes determining a sampling position for the group finger array based upon the coarse sampling position and the selected fine sampling offset (Step 1010). Operation concludes with receiving at least a portion of the plurality of individual distinct path signals at a corresponding plurality of time instants based upon the determined sampling position (Step 1012). From Step 1012, operation ends or, alternately, returns to Step 1002.

According to various aspects of the operations of FIG. 10, the plurality of individual distinct path signals in the signal cluster may be spread spectrum signals. In such case, a temporal distance between group fingers of the group finger array corresponds to a chip duration of the plurality of individual distinct path signals in the signal cluster. The plurality of group fingers includes 16 group fingers in some embodiments.

The coarse sampling position may be computed based upon a generated code and at least one computed aggregate power level of at least a portion of the plurality of individual distinct path signals. The method 1000 may include generating a code based on at least one of: a start time associated with the signal cluster, a code identification, and a timing reference signal. The method 1000 may also include computing a plurality of channel estimates based on at least one of: (1) the at least a portion of the plurality of individual distinct path signals; (2) a timing reference signal; and (3) at least one generated code. Further, the method 1000 may further include computing a plurality of power levels corresponding to the computed plurality of channel estimates.

The operation of Step 1008 of selecting a fine sampling offset based upon a corresponding maximum composite channel energy estimate may includes characterizing the relationship between a composite channel energy estimate and fine sampling offset and selecting a fine sampling offset that corresponds to a zero differential of the relationship between composite channel energy estimate and fine sampling offset. This operation may include implementing equation [19], described above.

While the present invention has been described with reference to certain embodiments, it will be understood by those skilled in the art that various changes may be made and equivalents may be substituted without departing from the scope of the present invention. In addition, many modifications may be made to adapt a particular situation or material to the teachings of the present invention without departing from its scope. Therefore, it is intended that the present invention not be limited to the particular embodiment disclosed, but that the present invention will include all embodiments falling within the scope of the appended claims.

Accordingly, the present invention may be realized in hardware, software, or a combination of hardware and software. The present invention may be realized in a centralized fashion in at least one computer system, or in a distributed fashion where different elements are spread across several interconnected computer systems. Any kind of computer system or other apparatus adapted for carrying out the methods described herein is suited. A typical combination of hardware and software may be a general-purpose computer system with a computer program that, when being loaded and executed, controls the computer system such that it carries out the methods described herein.

The present invention may also be embedded in a computer program product, which comprises all the features enabling the implementation of the methods described herein, and which when loaded in a computer system is able to carry out these methods. Computer program in the present context means any expression, in any language, code or notation, of a set of instructions intended to cause a system having an information processing capability to perform a particular function either directly or after either or both of the following: a) conversion to another language, code or notation; b) reproduction in a different material form.

As one of ordinary skill in the art will appreciate, the terms “operably coupled” and “communicatively coupled,” as may be used herein, include direct coupling and indirect coupling via another component, element, circuit, or module where, for indirect coupling, the intervening component, element, circuit, or module does not modify the information of a signal but may adjust its current level, voltage level, and/or power level. As one of ordinary skill in the art will also appreciate, inferred coupling (i.e., where one element is coupled to another element by inference) includes direct and indirect coupling between two elements in the same manner as “operably coupled” and “communicatively coupled.”

The present invention has also been described above with the aid of method steps illustrating the performance of specified functions and relationships thereof. The boundaries and sequence of these functional building blocks and method steps have been arbitrarily defined herein for convenience of description. Alternate boundaries and sequences can be defined so long as the specified functions and relationships are appropriately performed. Any such alternate boundaries or sequences are thus within the scope and spirit of the claimed invention.

The present invention has been described above with the aid of functional building blocks illustrating the performance of certain significant functions. The boundaries of these functional building blocks have been arbitrarily defined for convenience of description. Alternate boundaries could be defined as long as the certain significant functions are appropriately performed. Similarly, flow diagram blocks may also have been arbitrarily defined herein to illustrate certain significant functionality. To the extent used, the flow diagram block boundaries and sequence could have been defined otherwise and still perform the certain significant functionality. Such alternate definitions of both functional building blocks and flow diagram blocks and sequences are thus within the scope and spirit of the claimed invention.

One of average skill in the art will also recognize that the functional building blocks, and other illustrative blocks, modules and components herein, can be implemented as illustrated or by discrete components, application specific integrated circuits, processors executing appropriate software and the like or any combination thereof.

Moreover, although described in detail for purposes of clarity and understanding by way of the aforementioned embodiments, the present invention is not limited to such embodiments. It will be obvious to one of average skill in the art that various changes and modifications may be practiced within the spirit and scope of the present invention, as limited only by the scope of the appended claims. 

1. A method for processing radio frequency (RF) signals, the method comprising: detecting a maximum signal energy level of at least one of a plurality of individual distinct path signals in a signal cluster, wherein at least a portion of the plurality of individual distinct path signals is received within a duration of a corresponding delay spread; determining a coarse sampling position of a group finger array based upon a position of the maximum signal energy level of the at least one of a plurality of individual distinct path signals in a signal cluster, the group finger array including a plurality of group fingers; for each of a plurality of fine sampling offsets, determining a composite channel energy estimate for the plurality of individual distinct path signals; selecting a fine sampling offset based upon a corresponding maximum composite channel energy estimate by: characterizing the relationship between a composite channel energy estimate and fine sampling offset; and selecting a fine sampling offset that corresponds to a zero differential of the relationship between composite channel energy estimate and fine sampling offset; determining a sampling position for the group finger array based upon the coarse sampling position and the selected fine sampling offset; and receiving at least a portion of the plurality of individual distinct path signals at a corresponding plurality of time instants based upon the determined sampling position.
 2. The method of claim 1, wherein: the plurality of individual distinct path signals in the signal cluster comprise spread spectrum signals; and a temporal distance between group fingers of the group finger array corresponds to a chip duration of the plurality of individual distinct path signals in the signal cluster.
 3. The method of claim 1, wherein the plurality of group fingers comprises 16 group fingers.
 4. The method according to claim 1, wherein the coarse sampling position is computed based upon a generated code and at least one computed aggregate power level of at least a portion of the plurality of individual distinct path signals.
 5. The method according to claim 1, further comprising generating a code based on at least one of: a start time associated with the signal cluster, a code identification, and a timing reference signal.
 6. The method according to claim 1, further comprising computing a plurality of channel estimates based on at least one of: the at least a portion of the plurality of individual distinct path signals; a timing reference signal; and at least one generated code.
 7. The method according to claim 6, further comprising computing a plurality of power levels corresponding to the computed plurality of channel estimates.
 8. The method of claim 1, wherein selecting a fine sampling offset based upon a corresponding maximum composite channel energy estimate includes: characterizing the relationship between a composite channel energy estimate and fine sampling offset; and selecting a fine sampling offset that corresponds to a zero differential of the relationship between composite channel energy estimate and fine sampling offset.
 9. The method of claim 1, wherein selecting the fine sampling offset based upon a corresponding maximum composite channel energy estimate includes implementing the equation: ${{\frac{\mathbb{d}}{\mathbb{d}ϛ}{P(ϛ)}} \propto {\sum\limits_{i = {locked}}{{h_{i}^{*}(ϛ)}\frac{{h_{i}\left( {ϛ + \Delta} \right)} - {h_{i}\left( {ϛ - \Delta} \right)}}{2\Delta}}}} = 0$ when Δ→0; and where P(ζ) represents the composite channel energy estimate; and h_(i) represents a channel estimate value.
 10. The method of claim 1, wherein the RF signals are Code Division Multiple Access (CDMA) signals.
 11. A system for processing radio frequency (RF) signals, the system comprising: a searcher that detects a maximum signal energy level and position of at least one of a plurality of individual distinct path signals in a signal cluster, wherein at least a portion of the plurality of individual distinct path signals is received within a duration of a corresponding delay spread; and a cluster path processor that includes a group finger array having a plurality of group fingers, the cluster path processor operable to: determine a coarse sampling position of the group finger array based upon the position of the at least one of a plurality of individual distinct path signals in the signal cluster; for each of a plurality of fine sampling offsets, determine a composite channel energy estimate for the plurality of individual distinct path signals; select a fine sampling offset based upon a corresponding maximum composite channel energy estimate by: characterizing the relationship between a composite channel energy estimate and fine sampling offset; and selecting a fine sampling offset that corresponds to a zero differential of the relationship between composite channel energy estimate and fine sampling offset; determine a sampling position for the group finger array based upon the coarse sampling position and the selected fine sampling offset; and receive at least a portion of the plurality of individual distinct path signals by the group finger array at a corresponding plurality of time instants based upon the determined sampling position.
 12. The system of claim 11, wherein: the plurality of individual distinct path signals in the signal cluster comprise spread spectrum signals; and a temporal distance between group fingers of the group finger array of the cluster path processor corresponds to a chip duration of the plurality of individual distinct path signals in the signal cluster.
 13. The system of claim 11, wherein the plurality of group fingers comprises 16 group fingers.
 14. The system according to claim 11, wherein the coarse sampling position is computed based upon a generated code and at least one computed aggregate power level of at least a portion of the plurality of individual distinct path signals.
 15. The system according to claim 11, wherein the cluster path processor further comprises a code generator that generates a code based on at least one of: a start time associated with the signal cluster, a code identification, and a timing reference signal.
 16. The system according to claim 11, wherein the cluster path processor further comprises a channel estimator that computes a plurality of channel estimates based on at least one of: the received at least a portion of the plurality of individual distinct path signals, the sampling position, and at least one generated code.
 17. The system according to claim 16, wherein the cluster path processor further comprises channel power circuitry that computes a plurality of power levels corresponding to the computed plurality of channel estimates.
 18. The system of claim 11, wherein the cluster path processor, in selecting the fine sampling offset based upon a corresponding maximum composite channel energy estimate, is operable to: characterize the relationship between a composite channel energy estimate and fine sampling offset; and select a fine sampling offset that corresponds to a zero differential of the relationship between composite channel energy estimate and fine sampling offset.
 19. The system of claim 11, wherein the cluster path processor, in selecting the fine sampling offset based upon a corresponding maximum composite channel energy estimate, is operable to implement the equation: ${{\frac{\mathbb{d}}{\mathbb{d}ϛ}{P(ϛ)}} \propto {\sum\limits_{i = {locked}}{{h_{i}^{*}(ϛ)}\frac{{h_{i}\left( {ϛ + \Delta} \right)} - {h_{i}\left( {ϛ - \Delta} \right)}}{2\Delta}}}} = 0$ when Δ→0; and where P(ζ) represents the composite channel energy estimate; and h_(i) represents a channel estimate value.
 20. The system of claim 11, wherein the RF signals are Code Division Multiple Access (CDMA) signals.
 21. A system for processing radio frequency (RF) signals, the system comprising: a searcher that detects a maximum signal energy level and position of at least one of a plurality of individual distinct path signals in a signal cluster, wherein at least a portion of the plurality of individual distinct path signals is received within a duration of a corresponding delay spread; and a cluster path processor that includes a group finger array having a plurality of group fingers, the cluster path processor operable to: determine a coarse sampling position of the group finger array based upon the position of the at least one of a plurality of individual distinct path signals in the signal cluster; for each of a plurality of fine sampling offsets, determine a composite channel energy estimate for the plurality of individual distinct path signals; select a fine sampling offset based upon a corresponding maximum composite channel energy estimate by: characterizing the relationship between a composite channel energy estimate and fine sampling offset; and selecting a fine sampling offset that corresponds to a zero differential of the relationship between composite channel energy estimate and fine sampling offset; and determine a sampling position for the group finger array based upon the coarse sampling position and the selected fine sampling offset.
 22. The system of claim 21, wherein: the plurality of individual distinct path signals in the signal cluster comprise spread spectrum signals; and a temporal distance between group fingers of the group finger array of the cluster path processor corresponds to a chip duration of the plurality of individual distinct path signals in the signal cluster.
 23. The system of claim 21, wherein the plurality of group fingers comprises 16 group fingers.
 24. The system according to claim 21, wherein the coarse sampling position is computed based upon a generated code and at least one computed aggregate power level of at least a portion of the plurality of individual distinct path signals.
 25. The system of claim 21, wherein the cluster path processor, in selecting the fine sampling offset based upon a corresponding maximum composite channel energy estimate, is operable to: characterize the relationship between a composite channel energy estimate and fine sampling offset; and select a fine sampling offset that corresponds to a zero differential of the relationship between composite channel energy estimate and fine sampling offset.
 26. The system of claim 21, wherein the cluster path processor, in selecting the fine sampling offset based upon a corresponding maximum composite channel energy estimate, is operable to implement the equation: ${{\frac{\mathbb{d}}{\mathbb{d}ϛ}{P(ϛ)}} \propto {\sum\limits_{i = {locked}}{{h_{i}^{*}(ϛ)}\frac{{h_{i}\left( {ϛ + \Delta} \right)} - {h_{i}\left( {ϛ - \Delta} \right)}}{2\Delta}}}} = 0$ when Δ→0; and where P(ζ) represents the composite channel energy estimate; and h_(i) represents a channel estimate value.
 27. The system of claim 21, wherein the RF signals are Code Division Multiple Access (CDMA) signals. 